An Improved ZS Algorithm for High-Speed Synchronous Stream Ciphers
نویسندگان
چکیده
منابع مشابه
Resynchronization Weaknesses in Synchronous Stream Ciphers
In some applications for synchronous stream ciphers, the risk of loss of synchroniration cannot be eliminated completely. In these cases frequent rcsynchroniration or resynduonisation upon request may be necessary. In the paper it is shown that this can lead to significant deterioration of the cryptographic security. A powerful general attack on nonlinearly filtered linear (over Z,) systems is ...
متن کاملImproved Greedy Nonrandomness Detectors for Stream Ciphers
We consider the problem of designing distinguishers and nonrandomness detectors for stream ciphers using the maximum degree monomial test. We construct an improved algorithm to determine the subset of key and IV-bits used in the test. The algorithm is generic, and can be applied to any stream cipher. In addition to this, the algorithm is highly tweakable, and can be adapted depending on the des...
متن کاملThe Filter-Combiner Model for Memoryless Synchronous Stream Ciphers
We introduce a new model – the Filter-Combiner model – for memoryless synchronous stream ciphers. The new model combines the best features of the classical models for memoryless synchronous stream ciphers – the Nonlinear-Combiner model and the Nonlinear-Filter model. In particular, we show that the Filter-Combiner model provides key length optimal resistance to correlation attacks and eliminate...
متن کاملAn Improved Algorithm for High-speed Floating-point Addition
This paper describes an improved, IEEE conforming oating-point addition algorithm. This algorithm has only one addition step involving the signi cand in the worst-case path, hence o ering a considerable speed advantage over the existing algorithms, which typically require two to three addition steps.
متن کاملAn Improved Algorithm for Network Reliability Evaluation
Binary Decision Diagram (BDD) is a data structure proved to be compact in representation and efficient in manipulation of Boolean formulas. Using Binary decision diagram in network reliability analysis has already been investigated by some researchers. In this paper we show how an exact algorithm for network reliability can be improved and implemented efficiently by using CUDD - Colorado Univer...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The KIPS Transactions:PartC
سال: 2002
ISSN: 1598-2858
DOI: 10.3745/kipstc.2002.9c.3.307